Array Configurations That Tile the Plane

نویسنده

  • J. D. BUNTON
چکیده

Future radiotelescopes need to have high sensitivity. With the limits of receiver sensitivity being reached this can only be achieved by increasing collecting area. Because of this, next generation telescopes will have hundreds if not thousands of large antennas. The large number of antennas greatly increases the possible array configurations or ways of locating the antennas. In this paper a variety of antenna configurations are considered which divides the antennas into two classes 1. A single area of antennas where the antennas are placed on a widely spaced grid. 2. A set of compact components where, within each component, the antennas are closely packed. With these it is possible to obtain configurations that densely and uniformly sample the UV plane. This allows high quality imaging. The configurations also allow considerable savings in correlator complexity and demonstrate the possibility of asymmetric configurations

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Data Alignment Technique for Improving Cache Performance

We address the problem of improving the data cache performance of numerical applications – specifically, those with blocked (or tiled) loops. We present DAT, a data alignment technique utilizing array-padding, to improve program performance through minimizing cache conflict misses. We describe algorithms for selecting tile sizes for maximizing data cache utilization, and computing pad sizes for...

متن کامل

Ecole Normale Supérieure de Lyon

We study some decision problems concerning the tiling of the plane with Wang tiles We present a proof for the undecidability of the tiling problem for the whole plane and also for the periodic tiling In these poofs an aperiodic tile set is constructed We are interested in the second part in the link between the cardinality of possible tilings of the plane with a given tile set and the existence...

متن کامل

The Nilpotency Problem of One-Dimensional Cellular Automata

The limit set of a celullar automaton consists of all the configurations of the automaton that can appear after arbitrarily long computations. It is known that the limit set is never empty--it contains at least one homogeneous configuration. A CA is called nilpotent if its limit set contains just one configuration. The present work proves that it is algorithmically undecidable whether a given o...

متن کامل

A Complete Classification of Tile-makers

We extend the study of Akiyama’s tile-makers: surfaces whose developments all tile the plane. First, we prove that the developments of Akiyama’s tile-makers are the prototiles that tile the plane isohedrally with rotation and without reflection. Second, we give a simple characterization of all closed (boundaryless) tile-makers and give three new tile-makers not known to Akiyama. Finally, we pro...

متن کامل

Tiling Problems A.1 Introduction

In this appendix, we prove the undecidability of the following problems: the constrained domino problem (proved undecidable by Wang): give a tile set and a tile as input, ask whether it is possible to form a tiling of the plane containing the given tile; the unconstrained domino problem (Berger's Theorem): the input is a tile set and the question is whether one can tile the plane with it; the p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000